Descriptional complexity of context-free grammar forms
نویسندگان
چکیده
منابع مشابه
Descriptional Complexity of Context-Free Grammar Forms
Csuhaj-Vajh, E. and A. Kelemenovi, Descriptional complexity of context-free grammar forms, Theoretical Computer Science 112 (1993) 277-289. Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEI,q, LEV,<, VAR,<, PROD,< and DEP., related to any appropriate infinite class ‘8 of grammars are unbounded on the infinite class of languages d...
متن کاملDerivation Complexity in Context-Free Grammar Forms
Let F be an arbitrary context-free grammar form and (F) the family of grammars defined by F. For each grammar G in d(F), the derivation complexity function 6, on the language of G, is defined for each word x as the number of steps in a minimal G-derivation of x. It is shown that derivations may always be speeded up by any constant factor n, in the sense that for each positive integer n, an equi...
متن کاملDescriptional complexity measures of context-free languages
In [2], [3] and [4] several measures of descriptional complexity of context-free grammars (cfg's) and context-free languages (cfl's) have been investigated, most of them having the following properties: 1. The corresponding hierarchy of complexity classes of languages over two-letter alphabets is infinite. 2. The basic algorithmic problems are undecidable. (For example, the problems to determin...
متن کاملDescriptional Complexity of Bounded Context-Free Languages
Finite-turn pushdown automata (PDA) are investigated concerning their descriptional complexity. It is known that they accept exactly the class of ultralinear contextfree languages. Furthermore, the increase in size when converting arbitrary PDAs accepting ultralinear languages to finite-turn PDAs cannot be bounded by any recursive function. The latter phenomenon is known as non-recursive trade-...
متن کاملCompleteness of Context-Free Grammar Forms
The notions of a grammar form and g-interpretation were first introduced in [2]. However, it quickly became apparent, particularly for EOL forms [5], that (strict) interpretations had a wider interest as well as being better motivated mathematically. The study of parsing of grammar forms detailed in [4], the basic investigation in [8] on linear completeness amongst other results, the study of d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90021-k